Special cases of traveling salesman and repairman problems with time windows
نویسندگان
چکیده
منابع مشابه
Special cases of traveling salesman and repairman problems with time windows
Consider a complete directed graph in which each arc has a given length. There is a set ofjobs, each job i located at some node of the graph, with an associated processing time h i , and whose execution has to start within a prespecified time window [ r ; , d i ] . We have a single server that can move on the arcs of the graph, a t unit speed, and that has to execute all of the jobs within thei...
متن کاملSpeedup in the Traveling Repairman Problem with Constrained Time Windows
A bicriteria approximation algorithm is presented for the unrooted traveling repairman problem, realizing increased profit in return for increased speedup of repairman motion. The algorithm generalizes previous results from the case in which all time windows are the same length to the case in which their lengths can range between l and 2. This analysis can extend to any range of time window len...
متن کاملSpeedup in the Traveling Repairman Problem with Unit Time Windows
The input to the unrooted traveling repairman problem is an undirected metric graph and a subset of nodes, each of which has a time window of unit length. Given that a repairman can start at any location, the goal is to plan a route that visits as many nodes as possible during their respective time windows. A polynomial-time bicriteria approximation algorithm is presented for this problem, gain...
متن کاملTime-Dependent Traveling Salesman Problem with Multiple Time Windows
The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows. Moreover, since the assumption of constant travel time between two locatio...
متن کاملThe A Priori Dynamic Traveling Salesman Problem with Time Windows
The remarkable advances in telecommunications and information technology have enabled companies to focus on velocity and timeliness throughout the supply chain. To achieve these competitive advantages, they must be able to make effective use of the vast amount of real-time information now available to them. The Dynamic Vehicle Routing Problem (DVRP) is a prime example of a distribution context ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1992
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230220305